A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints

JOURNAL ARTICLE published July 2005 in Computational Optimization and Applications

Authors: Jin-bao Jian

A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints

JOURNAL ARTICLE published September 2002 in Journal of Computational and Applied Mathematics

Authors: G.S. Liu | J.Z. Zhang

A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints

JOURNAL ARTICLE published May 2006 in Computational Optimization and Applications

Authors: Xinwei Liu | Georgia Perakis | Jie Sun

On solving difference of convex functions programs with linear complementarity constraints

JOURNAL ARTICLE published September 2023 in Computational Optimization and Applications

Authors: Hoai An Le Thi | Thi Minh Tam Nguyen | Tao Pham Dinh

On convex quadratic programs with linear complementarity constraints

JOURNAL ARTICLE published April 2013 in Computational Optimization and Applications

Authors: Lijie Bai | John E. Mitchell | Jong-Shi Pang

Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches

JOURNAL ARTICLE published September 2021 in Computational Optimization and Applications

Research funded by Postdoctoral Research Foundation of China (2020M673117)

Authors: Shen Peng | Jie Jiang

A customized proximal point algorithm for convex minimization with linear constraints

JOURNAL ARTICLE published December 2013 in Computational Optimization and Applications

Authors: Bingsheng He | Xiaoming Yuan | Wenxing Zhang

Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints

JOURNAL ARTICLE published October 2014 in Computational Optimization and Applications

Authors: Christian Kanzow | Alexandra Schwartz

Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints

JOURNAL ARTICLE published January 2012 in Computational Optimization and Applications

Authors: A. F. Izmailov | A. L. Pogosyan | M. V. Solodov

An SQP method for mathematical programs with vanishing constraints with strong convergence properties

JOURNAL ARTICLE published June 2017 in Computational Optimization and Applications

Research funded by Austrian Science Fund (P 26132-N25)

Authors: Matúš Benko | Helmut Gfrerer

An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem

JOURNAL ARTICLE published January 2021 in Computational Optimization and Applications

Research funded by Natural Science Foundation of Shanghai (20ZR1420600) | National Natural Science Foundation of China (11771208)

Authors: Weiwei Pan | Jingjing Shen | Zi Xu

An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems

JOURNAL ARTICLE published January 1996 in Computational Optimization and Applications

Authors: L. Fernandes | J. J�dice | J. Patr�cio

Fast algorithm for singly linearly constrained quadratic programs with box-like constraints

JOURNAL ARTICLE published March 2017 in Computational Optimization and Applications

Research funded by National Natural Science Foundation of China (CN) (11371255,11001180) | National Natural Science Foundation of China (CN) (11371255) | the Program for Liaoning Excellent Talents in University (LR2015047) | Scientific Research Foundation for the Returned Overseas Chinese Scholars (JYB201302)

Authors: Meijiao Liu | Yong-Jin Liu

Solving optimal control problems with terminal complementarity constraints via Scholtes’ relaxation scheme

JOURNAL ARTICLE published March 2019 in Computational Optimization and Applications

Authors: Francisco Benita | Patrick Mehlitz

A new heuristic algorithm solving the linear ordering problem

JOURNAL ARTICLE published September 1996 in Computational Optimization and Applications

Authors: Stefan Chanas | Prezemysław Kobylański

Levenberg-Marquardt Method for Mathematical Programs with Linearly Complementarity Constraints

JOURNAL ARTICLE published 2015 in American Journal of Computational Mathematics

Authors: Cong Zhang | Limin Sun | Zhibin Zhu | Minglei Fang

Conic approximation to quadratic optimization with linear complementarity constraints

JOURNAL ARTICLE published January 2017 in Computational Optimization and Applications

Research funded by National Natural Science Foundation of China (11171177,11371216) | National Natural Science Foundation of China (11571029) | National Natural Science Foundation of Chin (11526186)

Authors: Jing Zhou | Shu-Cherng Fang | Wenxun Xing

On solving Linear Complementarity Problems by DC programming and DCA

JOURNAL ARTICLE published December 2011 in Computational Optimization and Applications

Authors: Hoai An Le Thi | Tao Pham Dinh

The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems

JOURNAL ARTICLE published November 2021 in Computational Optimization and Applications

Research funded by National Science Foundation of China (42004085,41725017) | National Science Foundation of China (61602309) | Postdoctoral Research Foundation of China (2019M663040) | Guangdong Basic and Applied Basic Research Foundation (2019A1515011384) | Shenzhen Fundamental Research Program (JCYJ20170817095210760) | Guangdong Basic and Applied Basic Research Foundation (2019A1515110184) | the national key r& d program of the ministry of science and technology of china (2020YFA0713400)

Authors: Zhizhi Li | Huai Zhang | Le Ou-Yang

Lifted stationary points of sparse optimization with complementarity constraints

JOURNAL ARTICLE published April 2023 in Computational Optimization and Applications

Research funded by Hong Kong Research Grant Council (PolyU15300120)

Authors: Shisen Liu | Xiaojun Chen